Higher-order functions

Results: 290



#Item
41Deriving Generic Functions by Example Neil Mitchell University of York, UK http://www.cs.york.ac.uk/~ndm/ Abstract. A function is said to be generic if it operates over values of

Deriving Generic Functions by Example Neil Mitchell University of York, UK http://www.cs.york.ac.uk/~ndm/ Abstract. A function is said to be generic if it operates over values of

Add to Reading List

Source URL: ndmitchell.com

Language: English - Date: 2016-04-19 09:56:22
42c ACM, 2008. This is the author’s version of the work. It is posted here by permission of ACM for your personal use. ° Not for redistribution. The definitive version was published in the Proceedings of the Haskell Sym

c ACM, 2008. This is the author’s version of the work. It is posted here by permission of ACM for your personal use. ° Not for redistribution. The definitive version was published in the Proceedings of the Haskell Sym

Add to Reading List

Source URL: ndmitchell.com

Language: English - Date: 2016-04-19 09:56:22
43Submission for IFLFlipping Fold, Reformulating Reduction An Exercise in Categorical Design Gershom Bazerman S&P/CapitalIQ

Submission for IFLFlipping Fold, Reformulating Reduction An Exercise in Categorical Design Gershom Bazerman S&P/CapitalIQ

Add to Reading List

Source URL: gbaz.github.io

Language: English - Date: 2016-02-29 17:49:20
44Fold-Based Fusion as a Library A Generative Programming Pearl Manohar Jonnalagedda, Sandro Stucki, EPFL Scala ‘15, Portland, June An Example

Fold-Based Fusion as a Library A Generative Programming Pearl Manohar Jonnalagedda, Sandro Stucki, EPFL Scala ‘15, Portland, June An Example

Add to Reading List

Source URL: lampwww.epfl.ch

Language: English - Date: 2015-06-14 21:36:50
45Supero: Making Haskell Faster

Supero: Making Haskell Faster

Add to Reading List

Source URL: ndmitchell.com

Language: English - Date: 2016-04-19 09:56:22
46Supero: Making Haskell Faster

Supero: Making Haskell Faster

Add to Reading List

Source URL: ndmitchell.com

Language: English - Date: 2016-04-19 09:56:22
47Counter-Example Complete Verification for Higher-Order Functions N. Voirol, E. Kneuss, V. Kuncak EPFL Scala Symposium 2015

Counter-Example Complete Verification for Higher-Order Functions N. Voirol, E. Kneuss, V. Kuncak EPFL Scala Symposium 2015

Add to Reading List

Source URL: lampwww.epfl.ch

Language: English - Date: 2015-06-14 21:40:26
48A Supercompiler for Core Haskell Neil Mitchell and Colin Runciman University of York, UK, http://www.cs.york.ac.uk/~ndm Abstract. Haskell is a functional language, with features such as higher order functions and lazy ev

A Supercompiler for Core Haskell Neil Mitchell and Colin Runciman University of York, UK, http://www.cs.york.ac.uk/~ndm Abstract. Haskell is a functional language, with features such as higher order functions and lazy ev

Add to Reading List

Source URL: ndmitchell.com

Language: English - Date: 2016-04-19 09:56:22
49Implicit Parallelism through Deep Language Embedding Alexander Alexandrov Asterios Katsifodimos Volker Markl

Implicit Parallelism through Deep Language Embedding Alexander Alexandrov Asterios Katsifodimos Volker Markl

Add to Reading List

Source URL: stratosphere.eu

Language: English - Date: 2016-05-27 12:05:58
50Supero: Making Haskell Faster Neil Mitchell and Colin Runciman University of York, UK, http://www.cs.york.ac.uk/~ndm Abstract. Haskell is a functional language, with features such as higher order functions and lazy evalu

Supero: Making Haskell Faster Neil Mitchell and Colin Runciman University of York, UK, http://www.cs.york.ac.uk/~ndm Abstract. Haskell is a functional language, with features such as higher order functions and lazy evalu

Add to Reading List

Source URL: ndmitchell.com

Language: English - Date: 2016-04-19 09:56:22